◀ Prev · Parts · Full · Next ▶

cite-note-1717. ↑ P. Erdős: Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292--294 MR8,479d; Zentralblatt 32,192.

cite-note-1818. ↑ citereferd-s1959Erdös, P. (1959). "Graph Theory and Probability". Canadian Journal of Mathematics. 11: 34–38. doi:10.4153/CJM-1959-003-9. ISSN 0008-414X. S2CID 122784453.

cite-note-1919. ↑ Seidel R. Backwards Analysis of Randomized Geometric Algorithms.

cite-note-2020. ↑ citerefkarger1999Karger, David R. (1999). "Random Sampling in Cut, Flow, and Network Design Problems". Mathematics of Operations Research. 24 (2): 383–413. CiteSeerX 10.1.1.215.794. doi:10.1287/moor.24.2.383.

cite-note-2121. ↑ "6.046J Lecture 22: Derandomization | Design and Analysis of Algorithms | Electrical Engineering and Computer Science". MIT OpenCourseWare. Retrieved 2024-12-27.

cite-note-2222. ↑ citereflubywigderson1995Luby, Michael; Wigderson, Avi (July 1995). Pairwise Independence and Derandomization (Report). USA: University of California at Berkeley.

◀ Prev · Parts · Full · Next ▶